Proof-Terms for Classical and Intuitionistic Resolution (Extended Abstract)
نویسندگان
چکیده
We exploit a system of realizers for classical logic, and a translation from resolution into the sequent calculus, to assess the in-tuitionistic force of classical resolution for a fragment of intuitionistic logic. This approach is in contrast to formulating locally intuitionistically sound resolution rules. The techniques use the-calculus, a development of Parigot's-calculus.
منابع مشابه
Proof-terms for classical and intuitionistic resolution
We extend Parigot's-calculus to form a system of realizers for classical logic which reeects the structure of Gentzen's cut-free, multiple-conclusioned, sequent calculus LK when used as a system for proof-search. Speciically, we add (i) a second binding operator, , which realizes classical, multiple-conclusioned disjunction, and (ii) explicit substitutions, , which provide suucient term-structu...
متن کاملSaturation-Based Theorem Proving: Past Successes and Future Potential (Abstract)
A resolution theorem prover for intuitionistic logic p. 2 Proof-terms for classical and intuitionistic resolution p. 17 Proof-search in intuitionistic logic with equality, or back to simultaneous rigid E-Unification p. 32 Extensions to a generalization critic for inductive proof p. 47 Learning domain knowledge to improve theorem proving p. 62 Patching faulty conjectures p. 77 Internal analogy i...
متن کاملFull Intuitionistic Linear Logic (extended abstract)
Hyland, M. and V. de Paiva, Full intuitionistic linear logic (extended abstract), Annals of Pure and Applied Logic 64 (1993) 273-291. In this paper we give a brief treatment of a theory of proofs for a system of Full Intuitionistic Linear Logic. This system is distinct from Classical Linear Logic, but unlike the standard Intuitionistic Linear Logic of Girard and Lafont includes the multiplicati...
متن کاملA Semantic View of Classical Proofs: Type-Theoretic, Categorical, and Denotational Characterizations (Preliminary Extended Abstract)
Classical logic is one of the best examples of a mathematical theory that is truly useful to computer science. Hardware and software engineers apply the theory routinely. Yet from a foundational standpoint, there are aspects of classical logic that are problematic. Unlike intuitionistic logic, classical logic is often held to be non-constructive, and so, is said to admit no proof semantics. To ...
متن کاملFresh Logic: proof-theory and semantics for FM and nominal techniques
In this paper we introduce Fresh Logic, a natural deduction style first-order logic extended with term-formers and quantifiers derived from the FM-sets model of names and binding in abstract syntax. Fresh Logic can be classical or intuitionistic depending on whether we include a law of excluded middle; we present a proof-normalisation procedure for the intuitionistic case and a semantics based ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996